Designs, Codes, Graphs and Related Areas
نویسنده
چکیده
9:009:50 Ryoh Fuji-Hara (University of Tsukuba) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Descendent sets and codes 10:0010:50 Yuichiro Fujiwara (California Institute of Technology) . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Codes and designs for quantum error correction 11:0011:50 Ken-ichi Kawarabayashi (National Institute of Informatics) . . . . . . . . . . . . . . . . . . . . . . 5 Combinatorial coloring of 3-colorable graphs
منابع مشابه
Permutation decoding for codes from designs, finite geometries and graphs
The method of permutation decoding was first developed by MacWilliams in the early 60’s and can be used when a linear code has a sufficiently large automorphism group to ensure the existence of a set of automorphisms, called a PD-set, that has some specifed properties. These talks will describe some recent developments in finding PD-sets for codes defined through the row-span over finite fields...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملAn excess theorem for spherical 2-designs
We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the excess. Here we give a characterization of Q-polynomial association schemes among spherical 2-designs.
متن کاملGraphs, designs and codes related to the n-cube
For integers n ≥ 1, k ≥ 0, and k ≤ n, the graph Γn has vertices the 2 vectors of F n 2 and adjacency defined by two vectors being adjacent if they differ in k coordinate positions. In particular Γn is the n-cube, usually denoted by Qn. We examine the binary codes obtained from the adjacency matrices of these graphs when k = 1, 2, 3, following results obtained for the binary codes of the n-cube ...
متن کاملCodes, Designs and Graphs from the Janko Groups
We construct some codes, designs and graphs that have the first or second Janko group, J1 or J2, respectively, acting as an automorphism group. We show computationally that the full automorphism group of the design or graph in each case is J1, J2 or J̄2, the extension of J2 by its outer automorphism, and we show that for some of the codes the same is true.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013